Approximate Shortest Homotopic Paths in Weighted Regions
نویسندگان
چکیده
Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈ (0, 1), we present the first algorithm to compute a path between s and t that can be deformed to P without passing over any obstacle and the path cost is within a factor 1+ ε of the optimum. The running time is O( 3 ε2 knpolylog(k, n, 1 ε )), where k is the number of segments in P and h and n are the numbers of obstacles and vertices in T , respectively. The constant in the running time of our algorithm depends on some geometric parameters and the ratio of the maximum region weight to the minimum region weight.
منابع مشابه
Approximate shortest paths in moderately anisotropic regions
We want to find an approximate shortest path for a point robot moving in a planar subdivision. Each face of the subdivision is associated with a convex distance function that has the following property: its unit disk contains a unit Euclidean disk, and is contained in a Euclidean disk with radius ρ. Obstacles are allowed, so there can be regions that the robot is not allowed to enter. We give a...
متن کاملComputing homotopic shortest paths in the plane
We address the problem of computing homotopic shortest paths in presence of obstacles in the plane. The problems on homotopy of the paths received attention very recently [3, 8]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [8]. The algorithm for non-simple paths achieves O(log n) time per outpu...
متن کاملAlgorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P , where P consists of triangular faces with positive weights assigned to them. The cost of a path in P is defined to be the weighted sum of Euclidean lengths of the sub-paths within each face of P . We present query algorithms that compute approximate distances and/or app...
متن کاملComputing Homotopic Shortest Paths Efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in linear time using the “funnel” algorithm of Chazelle [3] and Lee and Preparata [10]. A more general problem is to find a shortest path between two points in a polygonal domain. In this case the “rubber band” solution ...
متن کاملApproximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the classical geometric problem of determining shortest paths between pairs of points lying on a weighted polyhedral surface P consisting of n triangular faces. We present query algorithms that compute approximate distances and/or approximate (weighted) shortest paths. Our algorithm takes as input an approximation parameter ε ∈ (0, 1) and a query time parameter q and builds a data s...
متن کامل